منابع مشابه
The process of purely event-driven programs
Why not apply this notion to the design of a programming language? It is more than common that, behind the surface of its syntax, a programming language hides the process of its execution. A programmer can discover this process by reading the sometimes millions of lines of documentation or simply by trial-and-error. The process is also encoded in the toolchain provided with the language: compil...
متن کاملDeterministic Operations Research Some Examples
A summary of deterministic operations research models in linear programming, inventory theory, and dynamic programming. 1 Linear Programming A mathematical model of the problem is developed basically by applying a scientific approach as described earlier. There are a number of activities to be performed and each unit of each activity consumes some amount of each type of a resource. Resources ar...
متن کاملDeterministic Process Groups in dOS
Current multiprocessor systems execute parallel and concurrent software nondeterministically: even when given precisely the same input, two executions of the same program may produce different output. This severely complicates debugging, testing, and automatic replication for fault-tolerance. Previous efforts to address this issue have focused primarily on record and replay, but making executio...
متن کاملEffect of recycle on control of a purely integrating process
Chemical plant designs with heat or material recycle are becoming more common due to economic and environmental reasons. Underperforming control loops in chemical plants may in some cases be attributed to the presence of recycle streams. This is because recycle alters the dynamics of neighboring processes. During commissioning work, when control engineers are tuning control loops, they are ofte...
متن کاملDeterministic Cryptanalysis of some Stream Ciphers
A new graph-based approach to edit distance cryptanalysis of some clock-controlled generators is here presented in order to simplify search trees of the original attacks. In particular, the proposed improvement is based on cut sets defined on some graphs so that only the most promising branches of the search tree have to be analyzed because certain shortest paths provide the edit distances. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indiana University Mathematics Journal
سال: 1957
ISSN: 0022-2518
DOI: 10.1512/iumj.1957.6.56044